A note on disconjugacy for second order systems
نویسندگان
چکیده
منابع مشابه
A RESEARCH NOTE ON THE SECOND ORDER DIFFERENTIAL EQUATION
Let U(t, ) be solution of the Dirichlet problem y''+( t-q(t))y= 0 - 1 t l y(-l)= 0 = y(x), with variabIe t on (-1, x), for fixed x, which satisfies the initial condition U(-1, )=0 , (-1, )=1. In this paper, the asymptotic representation of the corresponding eigenfunctions of the eigen values has been investigated . Furthermore, the leading term of the asymptotic formula for ...
متن کاملA Pure First Order Representation for Undamped Second Order Descriptor Systems
The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...
متن کاملSystems-disconjugacy of a Fourth-order Differential Equation1
where r(x) >0 and p(x) are both continuous on [a, oo) and p(x) does not change sign, and related conjugate point properties to oscillation. They gave extensive evidence indicating that the oscillatory behavior when p(x) is positive is essentially different from that when p(x) is negative. Relatively little is known in general when p(x) changes sign or when derivative terms of order less than fo...
متن کاملA Note on Kamenev Type Theorems for Second Order Matrix Differential Systems
Some oscillation criteria are given for the second order matrix differential system Y ′′ +Q(t)Y = 0, where Y and Q are n× n real continuous matrix functions with Q(t) symmetric, t ∈ [t0,∞). These results improve oscillation criteria recently discovered by Erbe, Kong and Ruan by using a generalized Riccati transformation V (t) = a(t){Y ′(t)Y −1(t) + f(t)I}, where I is the n × n identity matrix, ...
متن کاملNote on Undecidability of Bisimilarity for Second-Order Pushdown Processes
Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by ε-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender’s forcing, and the related undecidability proof for first-order pushdown automata with ε-transitions (Jančar and Srba, JACM 2008). Language equivalence of pushdown auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1980
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1980.89.447